Testing Isomorphism of Lattices over CM-Orders
نویسندگان
چکیده
منابع مشابه
Testing isomorphism of lattices over CM-orders
A CM-order is a reduced order equipped with an involution that mimics complex conjugation. The Witt-Picard group of such an order is a certain group of ideal classes that is closely related to the “minus part” of the class group. We present a deterministic polynomial-time algorithm for the following problem, which may be viewed as a special case of the principal ideal testing problem: given a C...
متن کاملA Mordell Inequality for Lattices over Maximal Orders
In this paper we prove an analogue of Mordell’s inequality for lattices in finite-dimensional complex or quaternionic Hermitian space that are modules over a maximal order in an imaginary quadratic number field or a totally definite rational quaternion algebra. This inequality implies that 16dimensional Barnes-Wall lattice has optimal density among all 16-dimensional lattices with Hurwitz struc...
متن کاملOn the Number of Isomorphism Classes of Cm Elliptic Curves Defined over a Number Field
The theory of complex multiplication has proven to be an essential tool in number theory, mainly due to the connections with class field theory developed by Kronecker, Weber, Fricke, Hasse, Deuring, and Shimura, among others. Certain important results have been shown first in the case of complex multiplication. Thus, it is a natural question to find all the isomorphism classes of elliptic curve...
متن کاملTesting monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a nearly linear lower bound for the sample complexity of testing monotonicity with respect to the poset consisting of a directed perfect matching. This is the first nearly linear lower bound known for a natural non-symmet...
متن کاملTesting isomorphism of modules
We present a new deterministic algorithm to test constructively for isomorphism between two given finite-dimensional modules of a finitely generated algebra. The algorithm uses only basic field operations; for arbitrary fields, this is not possible with the existing methodology. Furthermore, the number of field operations used by the algorithm is bounded by a polynomial in the length of the inp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2019
ISSN: 0097-5397,1095-7111
DOI: 10.1137/17m115390x